#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e6+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL r1[maxn];
LL pre[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   for(LL i=0;i<n;i++){
       LL l;cin>>l;
       bool flag=0;
       LL minv=1e15;
       for(LL j=0;j<l;j++){
          LL x;cin>>x;
          if(minv<x) flag=1;
          r1[i]=max(r1[i],x); minv=min(minv,x);
       }
       if(flag) minv=-1,r1[i]=1e6;
       pre[minv+1]++;
   }
   for(LL i=1;i<=1e6;i++){
       pre[i]+=pre[i-1];
   }
   LL ans=0;
   for(LL i=0;i<n;i++){
       ans+=pre[r1[i]];
   }
   cout<<ans<<"\n";
   return 0;
}
